package org.example.dynamic_planning;

import java.util.Arrays;

public class editing_distance {
    public static void main(String[] args) {
        //编辑距离

        //给你两个单词 word1 和 word2， 请返回将 word1 转换成 word2 所使用的最少操作数  。
        //你可以对一个单词进行如下三种操作：
        //插入一个字符
        //删除一个字符
        //替换一个字符
        String word1 = "horse";
        String word2 = "ros";
        int i = minDistance(word1, word2);
        System.out.println(i);
    }
    public static int minDistance(String word1, String word2) {
        int[][] dp = new int[word1.length() + 1][word2.length() + 1];
        //初始化
        for (int i = 0; i <= word1.length(); i++) {
            dp[i][0] = i;
        }
        for (int j = 0; j <= word2.length(); j++) {
            dp[0][j] = j;
        }
        for (int i = 1; i <= word1.length(); i++) {
            for (int j = 1; j <= word2.length(); j++) {
                if (word1.charAt(i-1) == word2.charAt(j-1)){
                    dp[i][j] = dp[i-1][j-1];
                }else {
                    dp[i][j] = Math.min(dp[i-1][j-1],Math.min(dp[i-1][j],dp[i][j-1]))+1;
                }
            }
        }
        return dp[word1.length()][word2.length()];
    }
}
